#!/usr/bin/env python
#  -*- coding: utf-8 -*-


# 打印斐波那契数列递归过程


def fibo( num, s, layer):
	if num <=0 :
		return 0

	print("第%d层,num=%d：" % (layer, num))
	
	if(num>1):
		s =   "%s+%d" % (s, num-1) 
		print("%s+fibo(%d)" % (s, num-2) )


	layer = layer -1
	return num + fibo( num-1, s ,layer)

result = fibo(10, '10',10)
print("结果为: %d"%(result))

